An ant colony algorithm for universiti sultan zainal abidin examination timetabling problem
نویسندگان
چکیده
منابع مشابه
Internet use and addiction among medical students of Universiti Sultan Zainal Abidin, Malaysia
BACKGROUND The use of Internet has now become indispensable, and the technology has revolutionized the medical education and practice worldwide. Currently, medical students and professionals have an enormous opportunity to keep them always updated with the exponential growth of knowledge because of potential progression of Internet throughout the world that enables them to become a lifelong lea...
متن کاملPerceptions of students in different phases of medical education of the educational environment: Universiti Sultan Zainal Abidin
BACKGROUND The Dundee Ready Education Environment Measure (DREEM) was planned and designed to quantify the educational environment precisely for medical schools and health-related professional schools. DREEM is now considered a valid and reliable tool, which is globally accepted for measuring the medical educational environment. The educational environment encountered by students has an impact ...
متن کاملAnt Colony Algorithm for the Single Loop Routing Problem
In this paper, a new algorithm for solving the single loop routing problem is presented. The purpose of the single loop routing problem(SLRP) is to find the shortest loop for an automated guided vehicle covering at least one edge of each department of a block layout. First it shown that this problem can be represented as a graph model. Then a meta-heuristic algorithm based on and colony system ...
متن کاملAnt Colony Algorithm for the Single Loop Routing Problem
In this paper, a new algorithm for solving the single loop routing problem is presented. The purpose of the single loop routing problem(SLRP) is to find the shortest loop for an automated guided vehicle covering at least one edge of each department of a block layout. First it shown that this problem can be represented as a graph model. Then a meta-heuristic algorithm based on and colony system ...
متن کاملan effective ant colony algorithm for the traveling salesman problem
the traveling salesman problem (tsp) is a well-known combinatorial optimization problem and holds a central place in logistics management. the tsp has received much attention because of its practical applications in industrial problems. many exact, heuristic and metaheuristic approaches have been proposed to solve tsp in recent years. in this paper, a modified ant colony optimization (maco) is ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Indonesian Journal of Electrical Engineering and Computer Science
سال: 2019
ISSN: 2502-4760,2502-4752
DOI: 10.11591/ijeecs.v13.i1.pp191-198